Computational number theory - PDFSEARCH.IO - Document Search Engine

Computational number theory
Results: 224

#	Item
191	C:/Documents and Settings/Samantha.bibi/Desktop/My Dropbox/LTSC[removed]jucs_sample_paper_latex.dvi Add to Reading List Source URL: www.dline.info Language: English - Date: 2013-02-22 08:00:42 Stream ciphers Computational number theory Lattice points Linear algebra Cryptography Lenstra–Lenstra–Lovász lattice basis reduction algorithm Keystream Lattice problem Lattice reduction Algebra Mathematics Abstract algebra
192	RABINOWITSCH REVISITED Andrew Granville and Richard A. Mollin Add to Reading List Source URL: people.ucalgary.ca Language: English - Date: 2012-12-19 13:10:05 Number theory Sieve theory Arithmetic functions Jurkat–Richert theorem Computational complexity of mathematical operations Mathematics Information theory Theoretical computer science
193	Introduction Results Outline of the Methods Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2007-02-06 05:22:52 Real algebraic geometry Algebraic geometry Betti number Algorithm Computational complexity theory Mathematics Abstract algebra Topology
194	ANTS IX, Nancy, France Fixed points for discrete logarithms Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2010-07-16 15:47:41 Computational hardness assumptions Finite fields Logarithms Modular arithmetic Group theory Discrete logarithm Cyclic group Diffie–Hellman problem Prime number Abstract algebra Mathematics Algebra
195	Errata and clarifications for Prime numbers: a computational perspective, 2nd edition Updated February 18, 2009 R. Crandall and C. Pomerance Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2009-02-18 09:38:34 Finite fields Modular arithmetic Lenstra elliptic curve factorization Lucas–Lehmer primality test Integer factorization algorithms Mathematics Number theory
196	A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic Razvan Barbulescu1 , Pierrick Gaudry1 , Antoine Joux2,3 , and Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-11-25 07:10:45 Finite fields Group theory Logarithms Cryptography Computational complexity theory Time complexity Polynomial General number field sieve Field extension Abstract algebra Mathematics Algebra
197	The complexity of factoring univariate polynomials over the rationals Mark van Hoeij Add to Reading List Source URL: www.math.fsu.edu Language: English - Date: 2013-06-24 23:44:33 Lenstra–Lenstra–Lovász lattice basis reduction algorithm Lattice reduction Computational number theory Lattice points Mathematics
198	Computing over the Reals: Where Turing Meets Newton [removed] Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2004-06-22 10:29:01 Computer science Theory of computation Computational complexity theory Computable number Computable function Turing machine Halting problem Computability Real computation Theoretical computer science Computability theory Applied mathematics
199	Secure PRNGs from Specialized Polynomial Maps over Any Fq Michael Feng-Hao Liu∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-10-22 14:34:16 Probabilistic complexity theory Polynomials Pseudorandom number generator Randomized algorithm IP Coding theory Sipser–Lautemann theorem Normal distribution Theoretical computer science Mathematics Computational complexity theory
200	Cryptanalysis of the Dual Elliptic Curve Pseudorandom Generator Berry Schoenmakers and Andrey Sidorenko Dept. of Mathematics and Computer Science, TU Eindhoven, Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2006-09-15 11:33:41 Pseudorandomness Pseudorandom number generators Computational complexity theory Cryptography Randomness Pseudorandom generator Random number generation Elliptic curve cryptography Normal distribution Theoretical computer science Applied mathematics Mathematics

UPDATE